TSTP Solution File: NUM664^1 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM664^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 10:56:52 EDT 2023

% Result   : Theorem 3.35s 3.57s
% Output   : Proof 3.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : NUM664^1 : TPTP v8.1.2. Released v3.7.0.
% 0.08/0.14  % Command    : duper %s
% 0.14/0.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri Aug 25 10:46:55 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 3.35/3.57  SZS status Theorem for theBenchmark.p
% 3.35/3.57  SZS output start Proof for theBenchmark.p
% 3.35/3.57  Clause #0 (by assumption #[]): Eq (less x y) True
% 3.35/3.57  Clause #1 (by assumption #[]): Eq (Not (less y z) → Eq y z) True
% 3.35/3.57  Clause #3 (by assumption #[]): Eq (∀ (Xx Xy Xz : nat), less Xx Xy → less Xy Xz → less Xx Xz) True
% 3.35/3.57  Clause #4 (by assumption #[]): Eq (Not (less x z)) True
% 3.35/3.57  Clause #9 (by clausification #[4]): Eq (less x z) False
% 3.35/3.57  Clause #10 (by clausification #[1]): Or (Eq (Not (less y z)) False) (Eq (Eq y z) True)
% 3.35/3.57  Clause #11 (by clausification #[10]): Or (Eq (Eq y z) True) (Eq (less y z) True)
% 3.35/3.57  Clause #12 (by clausification #[11]): Or (Eq (less y z) True) (Eq y z)
% 3.35/3.57  Clause #13 (by clausification #[3]): ∀ (a : nat), Eq (∀ (Xy Xz : nat), less a Xy → less Xy Xz → less a Xz) True
% 3.35/3.57  Clause #14 (by clausification #[13]): ∀ (a a_1 : nat), Eq (∀ (Xz : nat), less a a_1 → less a_1 Xz → less a Xz) True
% 3.35/3.57  Clause #15 (by clausification #[14]): ∀ (a a_1 a_2 : nat), Eq (less a a_1 → less a_1 a_2 → less a a_2) True
% 3.35/3.57  Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 : nat), Or (Eq (less a a_1) False) (Eq (less a_1 a_2 → less a a_2) True)
% 3.35/3.57  Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 : nat), Or (Eq (less a a_1) False) (Or (Eq (less a_1 a_2) False) (Eq (less a a_2) True))
% 3.35/3.57  Clause #18 (by superposition #[17, 0]): ∀ (a : nat), Or (Eq (less y a) False) (Or (Eq (less x a) True) (Eq False True))
% 3.35/3.57  Clause #20 (by clausification #[18]): ∀ (a : nat), Or (Eq (less y a) False) (Eq (less x a) True)
% 3.35/3.57  Clause #21 (by superposition #[20, 12]): Or (Eq (less x z) True) (Or (Eq False True) (Eq y z))
% 3.35/3.57  Clause #22 (by clausification #[21]): Or (Eq (less x z) True) (Eq y z)
% 3.35/3.57  Clause #23 (by superposition #[22, 9]): Or (Eq y z) (Eq True False)
% 3.35/3.57  Clause #25 (by clausification #[23]): Eq y z
% 3.35/3.57  Clause #26 (by backward demodulation #[25, 0]): Eq (less x z) True
% 3.35/3.57  Clause #30 (by superposition #[26, 9]): Eq True False
% 3.35/3.57  Clause #32 (by clausification #[30]): False
% 3.35/3.57  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------